A Convergence Theorem in $L$-Optimal Design Theory

A rigidity theorem for L-theory

This paper was written in October, 1983, but never published. I am making it available on the internet in this form as a response to the requests for copies of the preprint received in the intervening years. As long as these servers are running, a dvi file of this paper will be available by gopher at gopher.math.uwo.ca and on the world wide web at http://www.math.uwo.ca. Only very minor changes...

Convergence theorem for an iterative algorithm of l-strict pseudocontraction

Strong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces

In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.

A computational model and convergence theorem for rumor dissemination in social networks

The spread of rumors, which are known as unverified statements of uncertain origin, may threaten the society and it's controlling, is important for national security councils of countries. If it would be possible to identify factors affecting spreading a rumor (such as agents’ desires, trust network, etc.) then, this could be used to slow down or stop its spreading. Therefore, a computational m...

An L 2 Convergence Theorem for Random Aane Mappings

We consider the composition of random i.i.d. aane maps of a Hilbert space to itself. We show convergence of the n'th composition in the Wasserstein metric via a contraction argument. The contraction condition involves the operator norm of the expectation of a bilinear form. This is contrasted with the usual contraction condition of a negative Lyapunov exponent. Our condition is stronger but eas...